A Shortest Path Dependency Kernel for Relation Extraction
نویسندگان
چکیده
We present a novel approach to relation extraction, based on the observation that the information required to assert a relationship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.
منابع مشابه
Study of Kernel-Based Methods for Chinese Relation Extraction
In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation extraction based on ACE 2007 corpus. For the convolution kernel, the performances of different parse tree spans involved in it for relation extraction are studied. Then, experiments with composite kernels, which are a combinatio...
متن کاملKernel approaches for genic interaction extraction
MOTIVATION Automatic knowledge discovery and efficient information access such as named entity recognition and relation extraction between entities have recently become critical issues in the biomedical literature. However, the inherent difficulty of the relation extraction task, mainly caused by the diversity of natural language, is further compounded in the biomedical domain because biomedica...
متن کاملDependency-directed Tree Kernel-based Protein-Protein Interaction Extraction from Biomedical Literature
There is a surge of research interest in protein-protein interaction (PPI) extraction from biomedical literature. While most of the state-of-the-art PPI extraction systems focus on dependency-based structured information, the rich structured information inherent in constituent parse trees has not been extensively explored for PPI extraction. In this paper, we propose a novel approach to tree ke...
متن کاملN-ary Biographical Relation Extraction using Shortest Path Dependencies
Modern question answering and summarizing systems have motivated the need for complex n-ary relation extraction systems where the number of related entities (n) can be more than two. Shortest path dependency kernels have been proven to be effective in extracting binary relations. In this work, we propose a method that employs shortest path dependency based rules to extract complex n-ary relatio...
متن کاملA Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction
The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method (1) only takes the sdp and word embedding as...
متن کامل